Nuprl Lemma : Rinit-compat 0,22

A:Realizer, ix:Id, T:Type, v:Tx  dom(R-state(A;i))  @i x initially v:T || A 
latex


Definitionsx:AB(x), P  Q, A, R-state(R;i), A || B, Prop, {T}, xt(x), t  T, Top, if b t else f fi, 1of(t), p  q, false, Y, True, Rplus?(x1), P & Q, Rplus-left(x1), Rplus-right(x1), Rnone?(x1), R-loc(R), Rds(R), Rda(R), p = q, R-base-domain(R), R-frame-compat(A;B), R-interface-compat(A;B), p  q, i=j, 2of(t), true, Reffect?(x1), Rframe?(x1), Rframe-x(x1), Reffect-x(x1), Reffect-knd(x1), Rframe-L(x1), Raframe?(x1), Raframe-k(x1), Raframe-L(x1), Rrframe?(x1), Rrframe-x(x1), Reffect-ds(x1), Rrframe-L(x1), Rsends?(x1), Rsframe?(x1), Rsframe-lnk(x1), Rsends-l(x1), Rsframe-tag(x1), Rsends-g(x1), Rsends-knd(x1), Rsframe-L(x1), Rbframe?(x1), Rbframe-k(x1), Rbframe-L(x1), Rsends-ds(x1), Rpre?(x1), Rpre-ds(x1), Rpre-a(x1), Rsends-dt(x1), Reffect-T(x1), Rsends-T(x1), P  Q, SQType(T), A & B, b, x  dom(f), x(s), , , deq-member(eq;x;L), reduce(f;k;as), False, P  Q, P  Q, Unit,
Lemmases realizer-induction, Id wf, not wf, assert wf, fpf-dom wf, id-deq wf, R-state wf, fpf-trivial-subtype-top, fpf wf, top wf, R-compat wf, Rinit wf, es realizer wf, Rnone wf, R-compat-Rplus2, fpf-join-dom, Rplus wf, bool cases, eq id wf, bool sq, bool wf, iff transitivity, eqtt to assert, assert-eq-id, not functionality wrt iff, fpf-single wf, fpf-single-dom, bnot wf, eqff to assert, assert of bnot, fpf-compatible-singles, fpf-empty-compatible-right, Kind-deq wf, fpf-empty wf, Rframe wf, Knd wf, lsrc wf, Rsframe wf, IdLnk wf, fpf-compatible-single2, fpf-empty-compatible-left, Reffect wf, decl-state wf, decl-type wf, fpf-join wf, lnk-decl wf, Rsends wf, locl wf, Rpre wf, Raframe wf, Rbframe wf, Rrframe wf

origin